On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
نویسندگان
چکیده
منابع مشابه
Remarks on dynamic monopolies with given average thresholds
Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and independent sets in a graph. We present results concerning dynamic monopolies in graphs of given average threshold values extending and generalizin...
متن کاملOn dynamic monopolies of graphs: the average and strict majority thresholds
Let G be a graph and τ : V (G) → N ∪ {0} be an assignment of thresholds to the vertices of G. A subset of vertices D is said to be a dynamic monopoly corresponding to (G, τ) if the vertices of G can be partitioned into subsets D0,D1, . . . ,Dk such that D0 = D and for any i ∈ {0, . . . , k − 1}, each vertex v in Di+1 has at least τ(v) neighbors in D0 ∪ . . . ∪Di. Dynamic monopolies are in fact ...
متن کاملOn irreversible dynamic monopolies in general graphs
Consider the following coloring process in a simple directed graph G(V, E) with positive indegrees. Initially, a set S of vertices are white, whereas all the others are black. Thereafter, a black vertex is colored white whenever more than half of its in-neighbors are white. The coloring process ends when no additional vertices can be colored white. If all vertices end up white, we call S an irr...
متن کاملOn dynamic monopolies of graphs with general thresholds
Let G be a graph and τ : V (G) → N be an assignment of thresholds to the vertices ofG. A subset of verticesD is said to be dynamic monopoly (or simply dynamo) if the vertices of G can be partitioned into subsets D0,D1, . . . ,Dk such that D0 = D and for any i = 1, . . . , k − 1 each vertex v in Di+1 has at least t(v) neighbors in D0∪ . . .∪Di. Dynamic monopolies are in fact modeling the irrever...
متن کاملAn Estimation of the Shortest and Largest Average Path Length in Graphs of Given Density
Many real world networks (graphs) are observed to be ’small worlds’, i.e., the average path length among nodes is small. On the other hand, it is somewhat unclear what other average path length values networks can produce. In particular, it is not known what the maximum and the minimum average path length values are. In this paper we provide a lower estimation for the shortest average path leng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 2015
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-2015-021-4